Four-valued semantics for relevant logics (and some of their rivals)

نویسنده

  • Greg Restall
چکیده

This paper gives an outline of three diierent approaches to the four-valued semantics for relevant logics (and other non-classical logics in their vicinity). The rst approach borrows from thèAustralian Plan' semantics, which uses a unary operator`' for the evaluation of negation. This approach can model anything that the two-valued account can, but at the cost of relying on insights from the Australian Plan. The second approach is natural, well motivated, independent of the Australian Plan, and it provides a semantics for the contraction-free relevant logic C (or RW). Unfortunately, its approach seems to model little else. The third approach seems to capture a wide range of formal systems, but at the time of writing, lacks a completeness proof.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Paraconsistent Reasoning for Expressive and Tractable Description Logics

Four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases, mainly ALC. This approach has a distinct advantage that it can be implemented by invoking classical reasoners to keep the same complexity as classical semantics. In this paper, we further study how to extend the four-valued semantics to more expressive description logics, such as...

متن کامل

Game theoretical semantics for some non-classical logics

Paraconsistent logics are the formal systems in which absurdities do not trivialise the logic. In this paper, we give Hintikka-style game theoretical semantics for a variety of paraconsistent and non-classical logics. For this purpose, we consider Priest’s Logic of Paradox, Dunn’s First-Degree Entailment, Routleys’ Relevant Logics, McCall’s Connexive Logic and Belnap’s four-valued logic. We als...

متن کامل

On Permutation in Simplified Semantics

This note explains an error in Restall’s ‘Simplified Semantics for Relevant Logics (and some of their rivals)’ [2] concerning the modelling conditions for the axioms of assertion A ! ((A ! B) ! B) (there called c6) and permutation (A ! (B ! C)) ! (B ! (A ! C)) (there called c7). We show that the modelling conditions for assertion and permutation proposed in ‘Simplified Semantics’ overgenerate. ...

متن کامل

A Note on Granular Reasoning and Semantics of FourValued Logics

Zooming reasoning systems is a mechanism for reasoning using granular computing. The key concept of the zooming reasoning system is focus, which represents sentences we use in the current step of reasoning. Murai et al. has proposed a three-valued valuation based on focus. On the other hand, the authors have proposed another concept of granularity, called visibility, and constructed a four-valu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Philosophical Logic

دوره 24  شماره 

صفحات  -

تاریخ انتشار 1995